Antisymmetric flows and strong oriented coloring of planar graphs
نویسنده
چکیده
منابع مشابه
Strong oriented chromatic number of planar graphs without cycles of specific lengths
A strong oriented k-coloring of an oriented graph G is a homomorphism φ from G to H having k vertices labelled by the k elements of an abelian additive group M , such that for any pairs of arcs −→ uv and −→ zt of G, we have φ(v)−φ(u) 6= −(φ(t)−φ(z)). The strong oriented chromatic number χs(G) is the smallest k such that G admits a strong oriented k-coloring. In this paper, we consider the follo...
متن کاملGood and Semi-Strong Colorings of Oriented Planar Graphs
A k?coloring of an oriented graph G = (V; A) is an assignment c of one of the colors 1; 2; : : :; k to each vertex of the graph such that, for every arc (x; y) of G, c(x) 6 = c(y). The k?coloring is good if for every arc (x; y) of G there is no arc (z; t) 2 A such that c(x) = c(t) and c(y) = c(z). A k?coloring is said to be semi?strong if for every vertex x of G, c(z) 6 = c(t) for any pair fz; ...
متن کاملStrong Oriented Chromatic Number of Planar Graphs without Short Cycles
Let M be an additive abelian group. An M-strong-oriented coloring of an oriented graph G is a mapping φ from V (G) to M such that φ(u) 6= φ(v) whenever −→uv is an arc in G and φ(v)−φ(u) 6= −(φ(t)−φ(z)) whenever −→uv and zt are two arcs in G. The strong oriented chromatic number of an oriented graph is the minimal order of a group M such that G has an M-strong-oriented coloring. This notion was ...
متن کاملL(2, 1)-Labeling of Oriented Planar Graphs
In this paper we study the L(2, 1)-labeling problem on oriented planar graphs with particular attention on the subclasses of oriented prisms, Halin and cactus graphs. For these subclasses more accurate results are presented. keywords: L(2, 1)-labeling, oriented graph coloring, digraphs, prisms, Halin graphs, cacti.
متن کاملVector Flows in Graphs and Integer Flows in Signed Graphs
My research focuses on the flow problems consisting of two parts, vector flows in graphs and integer flows in signed graphs. The concept of integer flows was first introduced by Tutte (1949) as a refinement of map coloring. In fact, integer flows is the dual concept of map coloring for planar graphs. This is often referred as duality theorem. Tutte proposed three celebrated flow conjectures whi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 273 شماره
صفحات -
تاریخ انتشار 2003